NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
921	F r o m Approximate to O p t i m a l Solutions: A Case Study of N u m b e r Partitioning Add to Reading List Source URL: ijcai.org Language: English - Date: 2008-09-30 05:19:33 NP-complete problems Mathematical optimization Operations research Dynamic programming Partition problem Search algorithms Subset sum problem Greedy algorithm Genetic algorithm Theoretical computer science Mathematics Applied mathematics
922	The Chaos Within Sudoku M´ aria Ercsey-Ravasz1, ∗ and Zolt´an Toroczkai2, 3, † arXiv:1208.0370v1 [nlin.CD] 1 Aug 2012 Add to Reading List Source URL: arxiv.org Language: English - Date: 2012-08-02 20:18:34 NP-complete problems Logic puzzles Recreational mathematics Constraint programming Logic in computer science 2-satisfiability Sudoku Constraint satisfaction Boolean satisfiability problem Theoretical computer science Mathematics Computational complexity theory
923	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: siam.org Language: English - Date: 2013-09-19 09:13:08 NP-complete problems Approximation algorithm Submodular set function Shortest path problem Bin packing problem Vertex cover Dominating set Independent set Computational complexity theory Theoretical computer science Graph theory Mathematics
924	metaSMT: Focus On Your Application Not On Solver Integration Finn Haedicke Stefan Frehse Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2011-09-06 04:07:56 Constraint programming Electronic design automation Formal methods Logic in computer science NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Solver Constraint satisfaction problem Theoretical computer science Applied mathematics Mathematics
925	Lecture XIV Page 1 “The shortest path between two truths in the real domain passes through the complex domain.” Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-11-21 18:55:28 Operations research Routing algorithms Network flow NP-complete problems Bellman–Ford algorithm Shortest path problem Dynamic programming Flow network Tree Mathematics Theoretical computer science Graph theory
926	metaSMT: A Unified Interface to SMT-LIB2 Heinz Riener1 Mathias Soeken1,2 Clemens Werther1 Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2014-07-29 13:06:58 Electronic design automation Formal methods Logic in computer science Constraint programming Satisfiability Modulo Theories Solver Boolean satisfiability problem Timeout Transmission Control Protocol Theoretical computer science Applied mathematics NP-complete problems
927	metaSMT: Focus On Your Application Not On Solver Integration Finn Haedicke, Stefan Frehse, Görschwin Fey, Daniel Große, Rolf Drechsler Group of Computer Architecture, University of Bremen, Germany Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2014-02-05 05:31:31 Logic in computer science Electronic design automation NP-complete problems Constraint programming Satisfiability Modulo Theories Valuation Integer factorization Theoretical computer science Applied mathematics Formal methods
928	Random Graphs and Their Applications Les graphes al´ eatoires et leurs applications (Org: Anthony Bonato (Wilfrid Laurier), Penny Haxell (Waterloo) and/et Nicholas Wormald (Waterloo)) TOM BOHMAN, Carnegie Mellon Univer Add to Reading List Source URL: cms.math.ca Language: English - Date: 2006-07-10 21:18:22 Graph coloring NP-complete problems Random graph Graph Connectivity Cubic graph Dense graph Matroid theory Randomized algorithm Graph theory Mathematics Theoretical computer science
929	Approximate Clustering of Fingerprint Vectors with Missing Values Andres Figueroa† † Avraham Goldstein‡ Andrzej Lingas? Add to Reading List Source URL: crpit.com Language: English - Date: 2012-01-19 01:27:42 Complexity classes NP-complete problems Operations research Mathematical optimization Approximation algorithm NP-complete NP Vertex cover Vector space Theoretical computer science Computational complexity theory Mathematics
930	Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study Jeremy Franky and Ian P. Gentz and Toby Walshz August 15, 1997 analysis of algorithms, computational complexity, phase tra Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2013-07-29 02:03:45 NP-complete problems Hamiltonian path Shortest path problem NP-complete Asymptotic analysis Graph coloring Graph Computational complexity theory Random graph Graph theory Theoretical computer science Mathematics

UPDATE